Computation of the Infinite Horizon Continuous Time Constrained Linear Quadratic Regulator
نویسندگان
چکیده
We present a method for computing the solution to the infinite horizon continuous-time constrained linear quadratic regulator (CLQR). The method relies on two main features: a multi-grid method for placing a finite number of time intervals, and a piece-wise linear parameterization of the input within the intervals. The input values at the grid points and slopes within the time intervals are computed via quadratic programs (QPs). The grids are gradually refined to efficiently improve the accuracy of the solution, and the required matrices and vectors for all QPs are computed offline and stored to improve the online efficiency. We present two examples, a single-input single-output unstable system and a threeinput three-output stable system, to show the main characteristics of the proposed computation method.
منابع مشابه
Computation of the constrained infinite time linear quadratic regulator
This paper presents an efficient algorithin for coiiiputing the solution to the constrained infinite time linear quadratic regulator (CLQR) problem for discrete time systems. The algorithm coinbiiies multi-parametric quadratic programming with reachability analysis to obtain the optiinal piecewise affine (PWA) feedback law. The algorithm reduces the time necessary to compute the PWA solution fo...
متن کاملA simple solution to the finite-horizon LQ problem with zero terminal state
This short paper deals with the classical finite-horizon linear-quadratic regulator problem with the terminal state constrained to be zero, for both continuous and discrete-time systems. Closed-form expressions for the optimal state and costate trajectories of the Hamiltonian system, as well as the corresponding control law, are derived through the solutions of two infinite-horizon LQ problems,...
متن کاملMixed Constrained Infinite Horizon Linear Quadratic Optimal Control
For a given initial state, a constrained infinite horizon linear quadratic optimal control problem can be reduced to a finite dimensional problem [12]. To find a conservative estimate of the size of the reduced problem, the existing algorithms require the on-line solutions of quadratic programs [10] or a linear program [2]. In this paper, we first show based on the Lyapunov theorem that the clo...
متن کاملThe explicit linear quadratic regulator for constrained systems
For discrete-time linear time invariant systems with constraints on inputs and states, we develop an algorithm to determine explicitly, the state feedback control law which minimizes a quadratic performance criterion. We show that the control law is piece-wise linear and continuous for both the "nite horizon problem (model predictive control) and the usual in"nite time measure (constrained line...
متن کاملSolving the infinite-horizon constrained LQR problem using splitting techniques
This paper presents a method to solve the constrained infinite-time linear quadratic regulator (LQR) problem. We use an operator splitting technique, namely the alternating minimization algorithm (AMA), to split the problem into an unconstrained LQR problem and a projection step, which are solved repeatedly, with the solution of one influencing the other. The first step amounts to the solution ...
متن کامل